Obtain Algorithm
نویسندگان
چکیده
An origin-based solution algorithm, named OBTAIN (origin-based traffic assignment for infrastructure networks), was recently developed for solving the traffic assignment problems (Bar-Gera and Boyce, 2003). This algorithm defines the solution variables in an intermediate way between links and routes, and has been proven to be superior to the link-based Frank-Wolfe method in both computational time for and accurate level of the solution for a large network. To address its usefulness, the OBTAIN algorithm is elaborated in a tutorial manner, especially in its two major steps for updating the restricting subnetworks and origin-based approach proportions, and then applied to a small supply chain network equilibrium problem. The obtained results comply with the sufficient conditions for restricted user equilibrium. Future research includes a real application of large networks and a comparison of the OBTAIN algorithm with the route-based gradient projection (GP) algorithm in terms of computational efficiency.
منابع مشابه
An employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملConstrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005